Defeasible Inheritance Networks and Linear Logic: Horn Fragments and Proof Nets
نویسنده
چکیده
Based on a remark of Girard (1992) and a formalization given by Fouqueré and Vauzeilles (1994), we investigate a formalization of defeasible inheritance reasoning in terms of linear logic. We show a correspondence between defeasible inheritance networks, a Horn fragment of linear logic, and proof nets for linear logic. In particular, we show a structural correspondence between defeasible inheritance networks and proof nets for our fragment of linear logic.
منابع مشابه
Abnormality Counts ! MSc
Defeasible inheritance networks provide a fruitful environment for modeling default reasoning. In this paper we aim to enhance their expressive power with the idea of abnormality minimisation, which plays a crucial role in circumscription. We implement it in two alternative network-based frameworks. The rst is in line with the received way of modeling default reasoning by means of inheritance n...
متن کاملNon-Monotonic Inference Rules for the Credulous Theory
Most of the theories that model default reasoning by means of defeasible inheritance networks proceed via construction of paths, and are therefore known as `path-based'. In spite of many advantages, these theories also face certain well-known problems. In particular, they do poorly when cyclic nets are at issue or when it comes up to extensions. In this paper we show that these problems may be ...
متن کاملPetri Nets, Horn Programs, Linear Logic, and Vector Games
Linear Logic was introduced by Girard as a resource-sensitive refinement of classical logic. In this paper we establish strong connections between natural fragments of Linear Logic and a number of basic concepts related to different branches of Computer Science such as Concurrency Theory, Theory of Computations, Horn Programming and Game Theory. In particular, such complete correlations allow u...
متن کاملA Linear Logic Based Approach to Timed Petri Nets
1.1 Relationship between Petri net and linear logic Petri nets were first introduced by Petri in his seminal Ph.D. thesis, and both the theory and the applications of his model have flourished in concurrency theory (Reisig & Rozenberg, 1998a; Reisig & Rozenberg, 1998b). The relationships between Petri nets and linear logics have been studied by many researchers (Engberg & Winskel, 1997; Farwer,...
متن کاملAn Algebraic Correctness Criterion for Intuitionistic Multiplicative Proof-Nets
We consider intuitionistic fragments of multiplicative linear logic for which we deene appropriate notions of proof-nets. These are based on a correctness criterion that consists of decorating the nodes of a proof-structure with monoidal terms that must obey constraints reminiscent of phase semantics.
متن کامل